منابع مشابه
From graph states to two-graph states
The name ‘graph state’ is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computing, and which has a natural graphical description. We present the two-graph state, this being a generalisation of the graph state and a two-graph representation of a stabilizer state. Mathematically, the two-graph state can ...
متن کاملTwo-setting Bell Inequalities for Graph States
Géza Tóth, 2, ∗ Otfried Gühne, † and Hans J. Briegel 4, ‡ Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Straße 1, D-85748 Garching, Germany, Research Institute of Solid State Physics and Optics, Hungarian Academy of Sciences, H-1525 Budapest P.O. Box 49, Hungary Institut für Quantenoptik und Quanteninformation, Österreichische Akademie der Wissenschaften, A-6020 Innsbruck, Austria, Inst...
متن کاملOptimal preparation of graph states
We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any graph state belongs to an equivalence class under local Clifford operations. We extend up to 12 qubits the classification of graph states according to their enta...
متن کاملBell inequalities for graph states.
We investigate the nonlocal properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state there is an inequality maximally violated only by that state. We show that for certain types of graph states the violation of these inequalities increases exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2008
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-008-9167-9